منابع مشابه
Conditional Complexity
We propose a notion of complexity for oriented conditional term rewrite systems. This notion is realistic in the sense that it measures not only successful computations but also partial computations that result in a failed rule application. A transformation to unconditional context-sensitive rewrite systems is presented which reflects this complexity notion, as well as a technique to derive run...
متن کاملQuantum conditional query complexity
We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associatedwith an underlying distribution. Amongst other properties, we (a) obtain speed-ups over the best known quantum algorithms for identity testing, equivalence testing and uniformity testing of probability distributions; (b) study the power of the...
متن کاملComplexity of Conditional Term Rewriting
We propose a notion of complexity for oriented conditional rewrite systemssatisfying certain restrictions. This notion is realistic in the sense that it measures notonly successful computations, but also partial computations that result in a failed ruleapplication. A transformation to unconditional context-sensitive rewrite systems is pre-sented which reflects this complexity no...
متن کاملConditional Kolmogorov complexity and universal probability
The conditional in conditional Kolmogorov complexity commonly is taken to be a finite binary string. The Coding Theorem of L.A. Levin connects unconditional prefix Kolmogorov complexity with the discrete universal distribution. The least upper semicomputable code-length is up to a constant equal to the negative logarithm of the greatest lower semicomputable probability mass function. We investi...
متن کاملConditional Constraint Satisfaction: Logical Foundations and Complexity
Conditional Constraint Satisfaction Problems (CCSPs) are generalizations of classical CSPs that support conditional activation of variables and constraints. Despite the interest emerged for CCSPs in the context of modelling the intrinsic dynamism of diagnosis, structural design, and product configuration applications, a complete characterization of their computational properties and of their ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00033-0